Zero Attracting Maximum Total Correntropy Algorithm for Sparse System Identification
نویسندگان
چکیده
منابع مشابه
A General Zero Attraction Proportionate Normalized Maximum Correntropy Criterion Algorithm for Sparse System Identification
A general zero attraction (GZA) proportionate normalized maximum correntropy criterion (GZA-PNMCC) algorithm is devised and presented on the basis of the proportionate-type adaptive filter techniques and zero attracting theory to highly improve the sparse system estimation behavior of the classical MCC algorithm within the framework of the sparse system identifications. The newly-developed GZA-...
متن کاملA Soft Parameter Function Penalized Normalized Maximum Correntropy Criterion Algorithm for Sparse System Identification
A soft parameter function penalized normalized maximum correntropy criterion (SPF-NMCC) algorithm is proposed for sparse system identification. The proposed SPF-NMCC algorithm is derived on the basis of the normalized adaptive filter theory, the maximum correntropy criterion (MCC) algorithm and zero-attracting techniques. A soft parameter function is incorporated into the cost function of the t...
متن کاملRecursive Generalized Maximum Correntropy Criterion Algorithm with Sparse Penalty Constraints for System Identification
To address sparse system identification problem in non-Gaussian impulsive noise environment, the recursive generalized maximum correntropy criterion (RGMCC) algorithm with sparse penalty constraints is proposed to combat impulsive-inducing instability. Specifically, a recursive algorithm based on the generalized correntropy with a forgetting factor of error is developed to improve the performan...
متن کاملSystem Identification Using Reweighted Zero Attracting Least Absolute Deviation Algorithm
In this paper, the l1 norm penalty on the filter coefficients is incorporated in the least mean absolute deviation (LAD) algorithm to improve the performance of the LAD algorithm. The performance of LAD, zero-attracting LAD (ZA-LAD) and reweighted zero-attracting LAD (RZA-LAD) are evaluated for linear time varying system identification under the non-Gaussian (α-stable) noise environments. Effec...
متن کاملConvex regularized recursive maximum correntropy algorithm
In this brief, a robust and sparse recursive adaptive filtering algorithm, called convex regularized recursive maximum correntropy (CR-RMC), is derived by adding a general convex regularization penalty term to the maximum correntropy criterion (MCC). An approximate expression for automatically selecting the regularization parameter is also introduced. Simulation results show that the CR-RMC can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.12.389